A Matrix Pencil Approach to the Row by Row Decoupling Problem for Descriptor Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Matrix Pencil Approach to the Row by Row Decoupling Problem for Descriptor Systems

The row by row decoupling problem (RRDP) for descriptor systems is considered using proportional state feedback and input transformation. Necessary and sufficient conditions for the solvability of the RRDP are provided. These solvability conditions can be readily verified. A constructive solution to the RRDP is given so that the desired feedback and input transformation matrices can be obtained...

متن کامل

Disturbance rejection and row-by-row decoupling for linear delay systems of neutral type

where x(t) ∈ IRn is the state, u(t) ∈ IRp the input, d(t) ∈ IRq is a disturbance and y(t) ∈ IRm the output. The matrices A0, A1, A−1, B0, C0 and D0 are of suitable dimensions. In this paper we assume that matrices B0 and C0 are of full rank. There are more general forms of delay systems of neutral type: with several delays, with distributed delays... Our considerations may be formulated for sys...

متن کامل

A polyhedral approach to the single row facility layout problem

The Single Row Facility Layout Problem (SRFLP) is the NP -hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heurist...

متن کامل

Row by row methods for semidefinite programming

We present a row-by-row (RBR) method for solving semidefinite programming (SDP) problem based on solving a sequence of problems obtained by restricting the n-dimensional positive semidefinite constraint on the matrix X. By fixing any (n − 1)-dimensional principal submatrix of X and using its (generalized) Schur complement, the positive semidefinite constraint is reduced to a simple second-order...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2006

ISSN: 0895-4798,1095-7162

DOI: 10.1137/s089547980343905x